I am currently a fourth-year Ph.D. student in Computer Science and Engineering at the University of Michigan, and I am very fortunate to be advised by Prof. Thatchaphol Saranurak. Prior to that, I was an undergraduate student at Institute for Interdisciplinary Information Sciences, Tsinghua University. During the spring and summer of 2020, I also made a wonderful research visit at UMich, advised by Prof. Seth Pettie.
I have broad interests in theoretical computer science, particularly in graph algorithms and data structures. My research focuses on designing fast algorithms for connectivity, distance, and flow problems across various (dynamic) models using graph decomposition techniques.

In the fall of 2023, I was a visiting student at the Simons Institute for the Data Structures and Optimization for Fast Algorithms program.
In the fall of 2024, I visited INSAIT in Sofia, Bulgaria.
In the summer of 2025, I am a research intern at Microsoft Research in Redmond, mentored by Sepideh Mahabadi and Jakub Tarnawski.

Last updated: July 2025

Publications

Unless stated otherwise, author names are in alphabetical order.

Conference Papers

Parallel $(1+\epsilon)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work [arXiv soon]
Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak and Shengzhe Wang
To appear in FOCS 2025

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts [arxiv]
Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak and Shengzhe Wang
To appear in ESA 2025

Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies [arxiv]
Yaowei Long, Seth Pettie and Thatchaphol Saranurak
SODA 2025

Unbreakable Decomposition in Close-to-Linear Time [arxiv]
Aditya Anand, Euiwoong Lee, Jason Li, Yaowei Long and Thatchaphol Saranurak
SODA 2025

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time [arxiv]
Bernhard Haeupler, Yaowei Long and Thatchaphol Saranurak
FOCS 2024

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity [arxiv]
Yaowei Long and Yunfan Wang
ICALP 2024

Tight Conditional Lower Bounds for Vertex Connectivity Problems [arxiv]
Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak and Benyu Wang
STOC 2023

Near-Optimal Deterministic Vertex-Failure Connectivity Oracles [arxiv]
Yaowei Long and Thatchaphol Saranurak
FOCS 2022

Planar Distance Oracles with Better Time-Space Tradeoffs [arxiv]
Yaowei Long and Seth Pettie
SODA 2021

Journal Papers

Almost Optimal Exact Distance Oracles for Planar Graphs [doi][pdf]
Panagiotis Charalampopoulos, Paweł Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen
J. ACM
Journal version of extended abstracts presented at SODA’18 [GMWW18], STOC’19 [CGMW19] and SODA’21 [LP21]

Services

Conference external referee for SODA2023, WADS2023, ESA2023, SODA2024, ITCS2024, STOC 2024, FOCS 2024, ESA 2024, SODA 2025, SOSA 2025, ICALP 2025, FOCS 2025

Journal external referee for ACM TALG, Algorithmica, SIAM Journal on Computing

Teaching

Graduate Student Instructor (TA) to Prof. Thatchaphol Saranurak
Design and Analysis of Algorithms. (EECS 586)
2023 Winter